An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization

Abstract The paper investigates the static dial-a-ride problem with ride and waiting time minimization. This is a new setting of significant practical relevance because several ride-sharing providers launched in recent years large European cities. In contrast to standard problem, these focus on general public. Therefore, they are amongst others competition taxis private cars, which makes more customer-oriented objective necessary. We present an adaptive neighbourhood search (ALNS) as well dynamic programming algorithm (DP), tested comprehensive computational studies. Although DP can only be used for single tour and, due effort, restricted version or small instances, ALNS also works efficiently larger instances. results indicate that proposals may help solve trade-off between individual transport, profitability provider, reduction traffic pollution.